DECOMPOSING GENERALIZED QUANTIFIERS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Quantifiers

We review recent work in the field of generalized quantifiers on finite models. We give an idea of the methods that are available in this area. Main emphasis is on definability issues, such as whether there is a logic for the PTIME properties of unordered finite models.

متن کامل

Learning generalized quantifiers

This paper addresses the question of the learnability of generalized quantifiers. This topic was first taken up in (van Benthem 1986a) but has received little attention since then. There are a few results: in (Clark 1996) it was shown that first-order generalized quantifiers are learnable with membership queries. In (Tiede 1999) it was shown, among other things, that the left upward monotone qu...

متن کامل

Negation and Generalized Quantifiers

Linguistic research has clearly shown that natural languages exhibit different forms of negation. Foremost among these are sentence negation and predicate negation. In this study, the relationship between both will be discussed. In particular, it wiu be argued that we can give an accurate description of the logical connections between sentence negation and predicate negation by reference to the...

متن کامل

Clarification and generalized quantifiers

We attempt to show that a classical concern of formal semantics, quantification, interacts in an interesting way with dialogue strategies when viewed from the perspective of our approach to semantics using Type Theory with Records (TTR). TTR analyzes semantic content in terms of structured semantic objects containing subcomponents and we argue that these components influence what a dialogue par...

متن کامل

Generalized Quantifiers and Logical Reducibilities

We consider extensions of first order logic (FO) and least fixed point logic (LFP) with generalized quantifiers in the sense of Lindström [Lin66]. We show that adding a finite set of such quantifiers to LFP fails to capture all polynomial time properties of structures, even over a fixed signature. We show that this strengthens results in [Hel92] and [KV92a]. We also consider certain regular inf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Review of Symbolic Logic

سال: 2008

ISSN: 1755-0203,1755-0211

DOI: 10.1017/s1755020308080234